A Branch-and-Bound Algorithm for Minimizing the Total Tardiness of Multiple Developers

A Branch-and-bound Algorithm for Single Machine Total Tardiness Problem with Release Dates

This article presents the preliminary results on a new branch-and-bound algorithm proposed for the single machine total tardiness problem with arbitrary release dates. The algorithm relies on dominance properties from the literature as well as a new branching condition. A new lower bounding technique for the problem is also introduced. The performance of the algorithm is compared to the perform...

A branch-and-bound algorithm with Lagrangian relaxation to minimize total tardiness on identical parallel machines

The purpose of this paper is to propose a new branch-and-bound algorithm for a class of scheduling problems to minimize total tardiness on identical parallel machines. In this algorithm, Lagrangian relaxation technique is applied to obtain a tight lower bound. In addition, the job dominance conditions for the single machine total tardiness problem are utilized for both restricting branches and ...

A hybrid GRASP algorithm for minimizing total weighted resource tardiness penalty costs in scheduling of project networks

In this paper, we consider scheduling of project networks under minimization of total weighted resource tardiness penalty costs. In this problem, we assume constrained resources are renewable and limited to very costly machines and tools which are also used in other projects and are not accessible in all periods of time of a project. In other words, there is a dictated ready date as well as a d...

An Efficient Algorithm to Allocate Parts to Cells Minimizing Total Tardiness and Idle Times

In the design of a cellular manufacturing system (CMS), one of the important problems is the cell formation in the form of machine grouping and parts family. This paper investigates an allocation of parts to common and specific cells; in such a way that each common cell is able to process all required parts. Further, this paper presents a mathematical programming model comprising such constrain...

A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem